Gray, Binary and Real Valued Encodings: Quad Search and Locality Proofs
نویسندگان
چکیده
This paper looks at proofs concerning Gray codes and the locality of local search; it is shown that in some cases such proofs can be generalized to Binary and real valued encodings, while in other cases such proofs do not hold for Binary encodings. The paper also looks at a modified form of Quad Search that is proven to converge in under 2L evaluations to a global optimum on unimodal 1-D bijective functions and to a local optimum on multimodal 1-D bijective functions. Quad Search directly exploits the locality of the Gray code representation.
منابع مشابه
Quad Search and Hybrid Genetic Algorithms
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than evaluations on unimodal 1-D functions and on multi-dimensional sphere functions, where bits are used to encode the function domain. Exploiting these ideas, we have constructed an algorithm we call Quad Search. Quad Search converges to a local optimum on unimodal 1-D functions in not more than functio...
متن کاملLocality, Distance Distortion, and Binary Representations of Integers
This paper investigates how the performance of evolutionary search is influenced by the locality and distance distortion of the used representation. The locality of a representation describes how well neighboring phenotypes correspond to neighboring genotypes. The distance distortion measures whether the distances between individuals are preserved when mapping the phenotypes onto the genotypes....
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملProperties of Gray and Binary Representations
Representations are formalized as encodings that map the search space to the vertex set of a graph. We define the notion of bit equivalent encodings and show that for such encodings the corresponding Walsh coefficients are also conserved. We focus on Gray codes as particular types of encoding and present a review of properties related to the use of Gray codes. Gray codes are widely used in conj...
متن کاملBinary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms
When using representations for genetic algorithms (GAs) every optimization problem can be separated into a genotype-phenotype and a phenotype-fitness mapping. The genotype-phenotype mapping is the used representation and the phenotype-fitness mapping is the problem that should be solved. This paper investigates how the use of different binary representations of integers influences the performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005